Finding Galaxy Clusters using Voronoi Tessellations

نویسندگان

  • Massimo Ramella
  • Walter Boschin
  • Dario Fadda
  • Mario Nonino
چکیده

We present an objective and automated procedure for detecting clusters of galaxies in imaging galaxy surveys. Our Voronoi Galaxy Cluster Finder (VGCF) uses galaxy positions and magnitudes to find clusters and determine their main features: size, richness and contrast above the background. The VGCF uses the Voronoi tessellation to evaluate the local density and to identify clusters as significative density fluctuations above the background. The significance threshold needs to be set by the user, but experimenting with different choices is very easy since it does not require a whole new run of the algorithm. The VGCF is non-parametric and does not smooth the data. As a consequence, clusters are identified irrispective of their shape and their identification is only slightly affected by border effects and by holes in the galaxy distribution on the sky. The algorithm is fast, and automatically assigns members to structures. A test run of the VGCF on the PDCS field centered at α = 13 26 and δ = +29 52’ (J2000) produces 37 clusters. Of these clusters, 12 are VGCF counterparts of the 13 PDCS clusters detected at the 3σ level and with estimated redshifts from z = 0.2 to z = 0.6. Of the remaining 25 systems, 2 are PDCS clusters with confidence level < 3σ and redshift z ≤ 0.6. Inspection of the 23 new VGCF clusters indicates that several of these clusters may have been missed by the matched filter algorithm for one or more of the following reasons: a) they are very poor, b) they are extremely elongated, c) they lie too close to a rich and/or low redshift cluster.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Cosmic Foam: Stochastic Geometry and Spatial Clustering across the Universe

Galaxy redshift surveys have uncovered the existence of a salient and pervasive foamlike pattern in the distribution of galaxies on scales of a few up to more than a hundred Megaparsec. The significance of this frothy morphology of cosmic structure has been underlined by the results of computer simulations. These suggest the observed cellular patterns to be a prominent and natural aspect of cos...

متن کامل

Centroidal Voronoi Diagrams and Euler-Lagrangian Methods for Astrophysical Simulations

Large scale cosmological simulations such as galaxy and star formation are of great interest to cosmologists. These simulations are done by consideration of relativistic, compressible, discontinuous fluids. Many techniques from particle based to adaptive meshing have been explored, each with advantages and disadvantages. Here, the limitations of centroidal Voronoi tessellations with these astro...

متن کامل

Edge-Weighted Centroidal Voronoi Tessellations

Most existing applications of centroidal Voronoi tessellations (CVTs) lack consideration of the length of the cluster boundaries. In this paper we propose a new model and algorithms to produce segmentations which would minimize the total energy — a sum of the classic CVT energy and the weighted length of cluster boundaries. To distinguish it with the classic CVTs, we call it an Edge-Weighted CV...

متن کامل

Symmetry-Break in Voronoi Tessellations

We analyse in a common framework the properties of the Voronoi tessellations resulting from regular 2D and 3D crystals and those of tessellations generated by Poisson distributions of points, thus joining on symmetry breaking processes and the approach to uniform random distributions of seeds. We perturb crystalline structures in 2D and 3D with a spatial Gaussian noise whose adimensional streng...

متن کامل

Simulation of the typical Poisson - Voronoi - Cox - Voronoi cell

We consider stationary Poisson-Voronoi tessellations (PVT) in the Euclidean plane and study properties of Voronoi tessellations induced by linear Poisson processes on the edges of the PVT. We are especially interested in simulation algorithms for the typical cell. Two different simulation algorithms are introduced. The first algorithm directly simulates the typical cell whereas the second algor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001